THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES
نویسندگان
چکیده
منابع مشابه
The Definability strength of Combinatorial Principles
We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a definable set. We prove that some consequences of Ramsey’s Theorem for colorings of pairs could help in simplifying the definitions of some Δ2 sets, while some oth...
متن کاملthe effect of taftan pozzolan on the compressive strength of concrete in the environmental conditions of oman sea (chabahar port)
cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...
The Strength of Some Combinatorial Principles Related to Ramsey’s Theorem for Pairs
We study the reverse mathematics and computability-theoretic strength of (stable) Ramsey’s Theorem for pairs and the related principles COH and DNR. We show that SRT2 implies DNR over RCA0 but COH does not, and answer a question of Mileti by showing that every computable stable 2-coloring of pairs has an incomplete ∆2 infinite homogeneous set. We also give some extensions of the latter result, ...
متن کاملDefinability of Combinatorial Functions and Their Linear Recurrence Relations
We consider functions of natural numbers which allow a combinatorial interpretation as density functions (speed) of classes of relational structures, such as Fibonacci numbers, Bell numbers, Catalan numbers and the like. Many of these functions satisfy a linear recurrence relation over Z or Zm and allow an interpretation as counting the number of relations satisfying a property expressible in M...
متن کاملSome Combinatorial Principles
We extend some large cardinal axioms of Jensen to weakly inaccessible cardinals. Related problems regarding the saturatedness of certain filters are also studied.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2016
ISSN: 0022-4812,1943-5886
DOI: 10.1017/jsl.2016.10